Position Auctions
نویسنده
چکیده
I analyze the equilibria of a game based on the ad auction used by Google and Yahoo. This auction is closely related to the assignment game studied by Shapley–Shubik, Demange–Gale–Sotomayer and Roth– Sotomayer. However, due to the special structure of preferences, the equilibria of the ad auction can be calculated explicitly and some known results can be sharpened. I provide some empirical evidence that the Nash equilibria of the position auction describe the basic properties of the prices observed in Google's ad auction reasonably accurately. © 2006 Elsevier B.V. All rights reserved. JEL classification: D44; M3
منابع مشابه
Pricing in Position Auctions and Online Advertising∗
This paper analyzes position auctions with general pricing rules. In these auctions, there are several items to be allocated which are commonly ranked by agents with unit demand. The preeminent example of position auctions is the “generalized second-price” (GSP) auction used by major search engines to sell online advertising. Edelman et al. (2007) establish that the ex post equilibrium of the G...
متن کاملA Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملUser modeling in position auctions: re-considering the GSP and VCG mechanisms
We introduce a study of position auctions, with an explicit modeling of user navigation through ads. We refer to our model as the PPA model, since it is most applicable in the context of pay-per-action position auctions. In this model, which is consistent with other recent approaches to user modeling, a typical user searches sequentially over the ordered list of ads. At each point the user has ...
متن کاملTractable Computational Methods for Finding Nash Equilibria of Perfect-Information Position Auctions
Due to the economic importance of the position auctions used by search engines to sell advertising, these auctions have received considerable recent study. However, most of this study has been analytic, and these analyses have relied on strong assumptions about the structure of the setting. In this paper, we show that it is feasible to perform computational equilibrium analyses of complex, real...
متن کاملPosition Auctions with Bidder-Specific Minimum Prices
Position auctions such as the Generalized Second Price (GSP) are commonly used for sponsored search, e.g., by Yahoo! and Google. We now have an understanding of the equilibria of these auctions, via game-theoretic concepts like Generalized English Auctions and the “locally envy-free” property, as well as through a relationship to the well-known, truthful Vickrey-Clarke-Groves (VCG) mechanism. I...
متن کاملBidding to the Top: VCG and Equilibria of Position-Based Auctions
Many popular search engines run an auction to determine the placement of advertisements next to search results. Current auctions at Google and Yahoo! let advertisers specify a single amount as their bid in the auction. This bid is interpreted as the maximum amount the advertiser is willing to pay per click on its ad. When search queries arrive, the bids are used to rank the ads linearly on the ...
متن کامل